Further implications of the Bessis-Moussa-Villani conjecture

We find further implications of the BMV conjecture, which states that for hermitian matrices A and B, the function Tr exp(A - t B) is the Laplace transform of a positive measure.Comment: LaTeX, 8 page

On Plouffe's Ramanujan Identities

Recently, Simon Plouffe has discovered a number of identities for the Riemann zeta function at odd integer values. These identities are obtained numerically and are inspired by a prototypical series for Apery's constant given by Ramanujan: $\zeta(3)=\frac{7\pi^3}{180}-2\sum_{n=1}^\infty\frac{1}{n^3(e^{2\pi n}-1)}$ Such sums follow from a general relation given by Ramanujan, which is rediscovered and proved here using complex analytic techniques. The general relation is used to derive many of Plouffe's identities as corollaries. The resemblance of the general relation to the structure of theta functions and modular forms is briefly sketched.Comment: 19 pages, 3 figures; v4: minor corrections; modified intro; revised concluding statement

Patterns of primes in arithmetic progressions

After the proof of Zhang about the existence of infinitely many bounded gaps between consecutive primes the author showed the existence of a bounded d such that there are arbitrarily long arithmetic progressions of primes with the property that p′ = p + d is the prime following p for each element of the progression. This was a common generalization of the results of Zhang and Green-Tao. In the present work it is shown that for every m we have a bounded m-tuple of primes such that this configuration (i.e. the integer translates of this m-tuple) appear as arbitrarily long arithmetic progressions in the sequence of all primes. In fact we show that this is true for a positive proportion of all m-tuples. This is a common generalization of the celebrated works of Green-Tao and Maynard/Tao. Dedicated to the 60th birthday of Robert F. Tich

On the negative spectrum of two-dimensional Schr\"odinger operators with radial potentials

For a two-dimensional Schr\"odinger operator $H_{\alpha V}=-\Delta-\alpha V$ with the radial potential $V(x)=F(|x|), F(r)\ge 0$, we study the behavior of the number $N_-(H_{\alpha V})$ of its negative eigenvalues, as the coupling parameter $\alpha$ tends to infinity. We obtain the necessary and sufficient conditions for the semi-classical growth $N_-(H_{\alpha V})=O(\alpha)$ and for the validity of the Weyl asymptotic law.Comment: 13 page

Shuffle relations for regularised integrals of symbols

We prove shuffle relations which relate a product of regularised integrals of classical symbols to regularised nested (Chen) iterated integrals, which hold if all the symbols involved have non-vanishing residue. This is true in particular for non-integer order symbols. In general the shuffle relations hold up to finite parts of corrective terms arising from renormalisation on tensor products of classical symbols, a procedure adapted from renormalisation procedures on Feynman diagrams familiar to physicists. We relate the shuffle relations for regularised integrals of symbols with shuffle relations for multizeta functions adapting the above constructions to the case of symbols on the unit circle.Comment: 40 pages,latex. Changes concern sections 4 and 5 : an error in section 4 has been corrected, and the link between section 5 and the previous ones has been precise

Uncovering Ramanujan's "Lost" Notebook: An Oral History

Here we weave together interviews conducted by the author with three prominent figures in the world of Ramanujan's mathematics, George Andrews, Bruce Berndt and Ken Ono. The article describes Andrews's discovery of the "lost" notebook, Andrews and Berndt's effort of proving and editing Ramanujan's notes, and recent breakthroughs by Ono and others carrying certain important aspects of the Indian mathematician's work into the future. Also presented are historical details related to Ramanujan and his mathematics, perspectives on the impact of his work in contemporary mathematics, and a number of interesting personal anecdotes from Andrews, Berndt and Ono

Analysis of Basis Pursuit Via Capacity Sets

Finding the sparsest solution $\alpha$ for an under-determined linear system of equations $D\alpha=s$ is of interest in many applications. This problem is known to be NP-hard. Recent work studied conditions on the support size of $\alpha$ that allow its recovery using L1-minimization, via the Basis Pursuit algorithm. These conditions are often relying on a scalar property of $D$ called the mutual-coherence. In this work we introduce an alternative set of features of an arbitrarily given $D$, called the "capacity sets". We show how those could be used to analyze the performance of the basis pursuit, leading to improved bounds and predictions of performance. Both theoretical and numerical methods are presented, all using the capacity values, and shown to lead to improved assessments of the basis pursuit success in finding the sparest solution of $D\alpha=s$

A Gaussian distribution for refined DT invariants and 3D partitions

We show that the refined Donaldson-Thomas invariants of C3, suitably normalized, have a Gaussian distribution as limit law. Combinatorially these numbers are given by weighted counts of 3D partitions. Our technique is to use the Hardy-Littlewood circle method to analyze the bivariate asymptotics of a q-deformation of MacMahon's function. The proof is based on that of E.M. Wright who explored the single variable case.Comment: 11 pages and 3 figure

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.Comment: 17 page

A Characterization of Bispecial Sturmian Words

A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian words.Comment: Accepted to MFCS 201